FLAG AREA MEASURES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface Area and Other Measures of Ellipsoids

A. We begin by studying the surface area of an ellipsoid in E as the function of the lengths of the semi-axes. We write down an explicit formula as an integral over Sn−1, use this formula to derive convexity properties of the surface area, to give sharp estimates for the surface area of a large-dimensional ellipsoid, to produce asymptotic formulas for the surface area and the isoperimetr...

متن کامل

Ising (conformal) fields and cluster area measures.

We provide a representation for the scaling limit of the d = 2 critical Ising magnetization field as a (conformal) random field by using Schramm-Loewner Evolution clusters and associated renormalized area measures. The renormalized areas are from the scaling limit of the critical Fortuin-Kasteleyn clusters and the random field is a convergent sum of the area measures with random signs. Extensio...

متن کامل

Computing polygonal path simplification under area measures

In this paper, we consider the restricted version of the well-known 2D line simplification problem under area measures and for restricted version. We first propose a unified definition for both of sum-area and difference-area measures that can be used on a general path of n vertices. The optimal simplification runs in O(n) under both of these measures. Under sum-area measure and for a realistic...

متن کامل

Flag Variety

1.1. QCoh on a stack. We know that QCoh forms a stack, i.e., sheaf of groupoids, over Schfpqc(S) for any scheme S. Thus if we have an fpqc sheaf of groupoids X over S, we can define QCoh(X ) as maps of sheaves X → QCoh on Schfpqc(S). By 2-Yoneda, this definition agrees with the usual notion of quasicoherent sheaves if X is a scheme. For various other (usually equivalent) definitions in the case...

متن کامل

Flag algebras

Asymptotic extremal combinatorics deals with questions that in the language of model theory can be re-stated as follows. For finite models M, N of an universal theory without constants and function symbols (like graphs, digraphs or hypergraphs), let p(M, N) be the probability that a randomly chosen sub-model of N with |M | elements is isomorphic to M . Which asymptotic relations exist between t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2019

ISSN: 0025-5793,2041-7942

DOI: 10.1112/s0025579319000226